A Family of Binary Sequences from Interleaved Construction and their Cryptographic Properties

نویسندگان

  • Jing Jane He
  • Daniel Panario
  • Qiang Wang
  • JING JANE HE
  • DANIEL PANARIO
  • QIANG WANG
چکیده

Families of pseudorandom sequences with low cross correlation have important applications in communications and cryptography. Among several known constructions of sequences with low cross correlations, interleaved constructions proposed by Gong uses two sequences of the same period with two-level autocorrelation. In this paper, we study the balance property and the cross correlation of interleaved sequences such that the base sequences may not have the same period, or they may not have two-level autocorrelation. In particular, we study the interleaved sequences of two Legendre sequences of periods p and q, respectively, where p and q are odd prime numbers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Complexity and Autocorrelation of two Classes of New Interleaved Sequences of Period 2N

The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of period 4N with optimal autocorrelation values have been constructed by Tang and Gong based on interleaving certain kinds of sequences of period N . In this pape...

متن کامل

Interleaved Sequences of Geometric Sequences Binarized with Legendre Symbol of Two Types

A pseudorandom number generator is widely used in cryptography. A cryptographic pseudorandom number generator is required to generate pseudorandom numbers which have good statistical properties as well as unpredictability. An m-sequence is a linear feedback shift register sequence with maximal period over a finite field. M-sequences have good statistical properties, however we must nonlinearize...

متن کامل

Synthesis of cryptographic interleaved sequences by means of linear cellular automata

This work shows that a class of pseudorandom binary sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, these linear automata generate all the solutions of a type of linear difference equations with binary coefficients. Interleaved sequences are just particular solutions of such equations. In this way, popular...

متن کامل

New Constructions of Binary Interleaved Sequences with Low Autocorrelation

The autocorrelation of a key stream sequence in a stream cipher is an important cryptographic property. This paper proposes two constructions of binary interleaved sequences of period 4N by selecting appropriate shift sequences, subsequences and complement sequences. And the autocorrelation functions of new sequences are given. The results show that these sequences have low autocorrelation unde...

متن کامل

Families of p-ary sequences with low correlation and large linear complexity

This paper generalizes a method of generating shift sequences in the interleaved construction proposed by Gong. With the new shift sequences, some new families of p-ary sequences with desired properties can be obtained. A lower bound on the number of new families of binary sequences is also established.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009